1603A - Di-visible Confusion - CodeForces Solution


constructive algorithms math number theory *1300

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define vi  vector<int>
#define vll vector<ll>
#define fo(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define show(x) for(auto ele:x)cout<<ele<<" "
#define input(arr,n) for(int i=0;i<n;i++)cin>>arr[i]
#define pair<int,int> pii;
#define priority_queue< int, vector<int>, greater<int> > pql;

int main()
{
	fastio();
	
    int t;
	cin>>t;
	for(int i=0; i<t; i++)
	{
	    int n;
	    cin>>n;
	    
	    vector<int>v;
	    for(int i=0; i<n; i++)
	    {
	    	int x;
	    	cin>>x;
	    	v.push_back(x);
		}
		int flag=1;
		if(n>=22)
		{
		    n=22;
		}
		for(int j=0; j<n; j++)
		{
			int t=0;
			for(int k=2; k<=j+2; k++)
			{
				if(v[j]%k==0)
				{
					t++;
				}
			}
			if(t==j+1)
			{
				flag=-1;
				break;
			}
		}
		if(flag==-1)
		{
			cout<<"NO"<<endl;
		}
		else
		{
			cout<<"YES"<<endl;
		}
		
	}
	return 0;
}


Comments

Submit
0 Comments
More Questions

1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two
812C - Sagheer and Nubian Market
272A - Dima and Friends
1352C - K-th Not Divisible by n
545C - Woodcutters
1528B - Kavi on Pairing Duty
339B - Xenia and Ringroad
189A - Cut Ribbon
1182A - Filling Shapes
82A - Double Cola
45A - Codecraft III
1242A - Tile Painting
1663E - Are You Safe
1663D - Is it rated - 3
1311A - Add Odd or Subtract Even
977F - Consecutive Subsequence
939A - Love Triangle
755A - PolandBall and Hypothesis
760B - Frodo and pillows
1006A - Adjacent Replacements
1195C - Basketball Exercise
1206A - Choose Two Numbers
1438B - Valerii Against Everyone
822A - I'm bored with life
9A - Die Roll
1430B - Barrels
279B - Books